Graph based Recommendation for Distributed Systems
نویسندگان
چکیده
منابع مشابه
Graph based Recommendation for Distributed Systems
A huge amount of information available through electronically, the requirement for effective information retrieval and the implementation of filtering tools have become more necessary for easy retrieval of relevant information. Recommendation Systems (RS) are the software tools and methods providing recommendation for items as well as services to be of need to a user. These systems are providin...
متن کاملGraph-based Analysis for E-Commerce Recommendation
Recommender systems automate the process of recommending products and services to customers based on various types of data including customer demographics, product features, and, most importantly, previous interactions between customers and products (e.g., purchasing, rating, and catalog browsing). Despite significant research progress and growing acceptance in real-world applications, two majo...
متن کاملTrust-Based Recommendation Based on Graph Similarity
Trust networks are directed weighted graphs whose nodes represent agents and edges represent trust between agents. This paper proposes a trust-based recommendation approach, which can recommend trustworthy agents to a requester in a trust network. We consider a good recommendation as one to an agent that the requester’s trusted neighbors trust highly. We relate the recommendation problem to the...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملSearch Trees for Distributed Graph Transformation Systems
Graph transformation systems, like PROGRES and Fujaba, can be used for modeling software systems of various domains, and support the automatic generation of executable code. A graph transformation rule is executed only if the pattern of the transformation’s left-hand side is found in the graph. The search for the pattern has an exponential worst-case complexity. In many cases, the average compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2017
ISSN: 0975-8887
DOI: 10.5120/ijca2017914376